Optimising Maintenance Intervals for a Component using a New Hill-Climbing Algorithm
نویسنده
چکیده
Maintenance reduces the occurrence of failures of a component (or IT product) and also extends its useful life. This way the time to dispose of such a component may be delayed and this reduces the rate at which greenhouse gases enter into the food chain and the atmosphere. It will be helpful to produce set of maintenance intervals for such component at which its extended useful life and cost are most improved. This set will consist of trade-offs between extended life and cost and is known as optimal set. This paper builds on earlier work to define the optimisation of the maintenance intervals of a given component with respect to its extended useful life and cost. The paper also establishes and uses a new approach of hillclimbing search algorithm.
منابع مشابه
A Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملComparison of Genetic and Hill Climbing Algorithms to Improve an Artificial Neural Networks Model for Water Consumption Prediction
No unique method has been so far specified for determining the number of neurons in hidden layers of Multi-Layer Perceptron (MLP) neural networks used for prediction. The present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. The data used in the present research for prediction are consumption data of water...
متن کاملApplication of a hill-climbing algorithm to exact and approximate inference in credal networks
This paper proposes two new algorithms for inference in credal networks. These algorithms enable probability intervals to be obtained for the states of a given query variable. The first algorithm is approximate and uses the hill-climbing technique in the ShenoyShafer architecture to propagate in join trees; the second is exact and is a modification of Rocha and Cozman’s branch-and-bound algorit...
متن کاملHill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
This paper proposes two new algorithms for inference in credal networks. These algorithms enable probability intervals to be obtained for the states of a given query variable. The first algorithm is approximate and uses the hill-climbing technique in the Shenoy–Shafer architecture to propagate in join trees; the second is exact and is a modification of Rocha and Cozman’s branch-and-bound algori...
متن کاملDesign of Endlessly Single Mode Photonic Crystal Fibers with Desirable Properties using HC-EDA Algorithm
In this article, Hill Climbing (HC) and Estimation of Distribution Algorithm (EDA) are integrated to produce a hybrid intelligent algorithm for design of endlessly Single Mode Photonic Crystal Fibers (SMPCFs) structure with desired properties over the C communication band. In order to analyzing the fiber components, Finite Difference Frequency Domain (FDFD) solver is applied. In addition, a spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011